package fun.coding.leetcode;

public class MaximalRectangle {

	public static void main(String[] args) {

	}
	
	public int maximalRectangle(char[][] matrix) {
		if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return 0;
		
		int m = matrix.length;
		int n = matrix[0].length;
		
		int[][] lookup = new int[m+1][n+1];
		
		for (int i = 1; i <= m; i++) {
			for (int j = 1; j <= n; j++) {
				
			}
		}
		
		return 0;
	}

}
